منابع مشابه
A Classical Analog of Quantum Search *
Quantum search is a quantum mechanical technique for searching N possibilities in only √ N steps. We show that the algorithm can be described as a resonance phenomenon. A similar algorithm applies in a purely classical setting when there are N oscillators, one of which is of a different resonant frequency. We could identify which one this is by measuring the oscillation frequency of each oscill...
متن کاملClassical analog to topological nonlocal quantum interference effects.
The two main features of the Aharonov-Bohm effect are the topological dependence of accumulated phase on the winding number around the magnetic fluxon, and nonlocality-local observations at any intermediate point along the trajectories are not affected by the fluxon. The latter property is usually regarded as exclusive to quantum mechanics. Here we show that both the topological and nonlocal fe...
متن کاملObserving Dirac's classical phase space analog to the quantum state.
In 1945, Dirac attempted to develop a “formal probability” distribution to describe quantum operators in terms of two noncommuting variables, such as position x and momentum p [Rev. Mod. Phys. 17, 195 (1945)]. The resulting quasiprobability distribution is a complete representation of the quantum state and can be observed directly in experiments. We measure Dirac’s distribution for the quantum ...
متن کاملHamiltonian and measuring time for analog quantum search
We derive in this study a Hamiltonian to solve with certainty the analog quantum search problem analogue to the Grover algorithm. The general form of the initial state is considered. Since the evaluation of the measuring time for finding the marked state by probability of unity is crucially important in the problem, especially when the Bohr frequency is high, we then give the exact formula as a...
متن کاملImplementation of quantum search algorithm using classical Fourier optics.
We report on an experiment on Grover's quantum search algorithm showing that classical waves can search a N-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed iteratively as the pulse bounces back and forth between two mirrors. We directly observe the sought item being found in approximately square root[N] iterations, in the fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2002
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.65.032319